On the structure and syntactic complexity of generalized definite languages
نویسندگان
چکیده
We give a forbidden pattern characterization for the class of 5 generalized definite languages, show that the corresponding problem is 6 NL-complete and can be solved in quadratic time. We also show that 7 their syntactic complexity coincides with that of the definite languages 8 and give an upper bound of n! for this measure. 9
منابع مشابه
The Relationship between Syntactic and Lexical Complexity in Speech Monologues of EFL Learners
: This study aims to explore the relationship between syntactic and lexical complexity and also the relationship between different aspects of lexical complexity. To this end, speech monologs of 35 Iranian high-intermediate learners of English on three different tasks (i.e. argumentation, description, and narration) were analyzed for correlations between one measure of sy...
متن کاملImpact of Dynamic Assessment on the Writing Performance of English as Foreign Language Learners in Asynchronous Web 2.0 and Face-to-face Environments
This study sought to investigate dynamic assessment (DA) - an assessment approach that embeds inter- vention within the assessment process and that yields information about the learner’s responsiveness to this intervention - and the writing performance of the second language (L2) learners in Web 2.0 contexts. To this end, pre and post-treatment writings of 45 par...
متن کاملSyntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages
We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a function of the state complexity n of the languages. We prove that (n − 1)! is a tight upper bound for finite/cofinite languages and that it can be reached on...
متن کاملSyntactic Complexities of Six Classes of Star-Free Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, taken as a function of the state complexity n of these languages. We study the syntactic complexity of six subclasses of star-free languages. We find a tight upper bound of (n−...
متن کاملThe Effect of Reducing Lexical and Syntactic Complexity of Texts on Reading Comprehension
The present study investigated the effect of different types of text simplification (i.e., reducing the lexical and syntactic complexity of texts) on reading comprehension of English as a Foreign Language learners (EFL). Sixty female intermediate EFL learners from three intact classes in Tabarestan Language Institute in Tehran participated in the study. The intact classes were assigned to three...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1304.5714 شماره
صفحات -
تاریخ انتشار 2013